On the Role of Matrix-Weights Elements in Consensus Algorithms for Multi-Agent Systems

This paper examines the roles of matrix weight elements in matrix-weighted consensus. The consensus algorithms dictate that all agents reach when weighted graph is connected. However, it not always case for graphs. conditions leading to different types have been extensively analysed based on properties Laplacians and theoretic methods. practice, there concern how pick matrix-weights achieve some desired consensus, or change weights affects algorithm. By selecting weights, clusters may be possible. In this paper, we map systems We explore choice clustering. Our results are demonstrated a network three where each agent has states.